class Solution {
public:
    bool IsContinuous( vector<int> numbers ) {
        if(numbers.empty())
            return false;
        sort(numbers.begin(),numbers.end());
        int zero_count=0;
        int gap_count=0;
        int len=numbers.size();
        for(int i=0;i<len&&numbers[i]==0;i++)
            zero_count++;
        int small=zero_count;
        int big=small+1;
        while(big<len){
            if(numbers[small]==numbers[big])
                return false;
            gap_count+=numbers[big]-numbers[small]-1;
            small++;
            big++;
        }
        return gap_count>zero_count?false:true;
    }
};